A complete logic for behavioural equivalence in coalgebras of finitary set functors
نویسندگان
چکیده
منابع مشابه
Recursive coalgebras of finitary functors
For finitary set functors preserving inverse images several concepts of coalgebras A are proved to be equivalent: (i) A has a homomorphism into the initial algebra, (ii) A is recursive, i.e., A has a unique coalgebra-to-algebra morphism into any algebra, and (iii) A is parametrically recursive. And all these properties mean that the system described by A always halts in finitely many steps.
متن کاملCoequational Logic for Finitary Functors
Coequations, which are subsets of a cofree coalgebra, can be viewed as properties of systems. In case of a polynomial functor, a logic of coequations was formulated by J. Adámek. However, the logic is more complicated for other functors than polynomial ones, and simple deduction rules can no longer be formulated. A simpler coequational logic for finitely branching labelled transition systems wa...
متن کاملA Note on Expressive Coalgebraic Logics for Finitary Set Functors
This paper has two purposes. The first is to present a final coalgebra construction for finitary endofunctors on Set that uses a certain subset L ∗ of the limit L of the first ω terms in the final sequence. L∗ is the set of points in L which arise from all coalgebras using their canonical morphisms into L, and it was used earlier for different purposes in Kurz and Pattinson [5]. Viglizzo in [11...
متن کاملFunctors for Coalgebras
Functors preserving weak pullbacks provide the basis for a rich structure theory of coalgebras. We give an easy to use criterion to check whether a functor preserves weak pullbacks. We apply the characterization to the functor F which associates a set X with the set F(X) of all filters on X. It turns out that this functor preserves weak pullbacks, yet does not preserve weak generalized pullback...
متن کاملFinitary Functors: From Set to Preord and Poset
We investigate how finitary functors on Set can be extended or lifted to finitary functors on Preord and Poset and discuss applications to coalgebra.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logical and Algebraic Methods in Programming
سال: 2018
ISSN: 2352-2208
DOI: 10.1016/j.jlamp.2017.05.001